A General Self-Adaptive Relaxed-PPA Method for Convex Programming with Linear Constraints
نویسندگان
چکیده
منابع مشابه
A New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints
Most research on bilevel linear programming problem is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...
متن کاملFully fuzzy linear programming with inequality constraints
Fuzzy linear programming problem occur in many elds such as mathematical modeling, Control theory and Management sciences, etc. In this paper we focus on a kind of Linear Programming with fuzzy numbers and variables namely Fully Fuzzy Linear Programming (FFLP) problem, in which the constraints are in inequality forms. Then a new method is proposed to ne the fuzzy solution for solving (FFLP). Nu...
متن کاملA splitting method for separate convex programming with linking linear constraints
We consider the separate convex programming problem with linking linear constraints, where the objective function is in the form of the sum of m individual functions without crossed variables. The special case with m = 2 has been well studied in the literature and some algorithms are very influential, e.g. the alternating direction method. The research for the case with general m, however, is i...
متن کاملAn adaptive barrier method for convex programming
This paper presents a new barrier method for convex programming. The method involves an optimization transfer principle. Instead of minimizing the objective function f(x) directly, one minimizes the amended function f(x)− μ P i x i lnxi to produce the next iterate x n+1 from the current iterate x. If the feasible region is contained in the unit simplex, then this strategy forces a decrease in f...
متن کاملCharacterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints
This paper studies the convex multiobjective optimization problem with vanishing constraints. We introduce a new constraint qualification for these problems, and then a necessary optimality condition for properly efficient solutions is presented. Finally by imposing some assumptions, we show that our necessary condition is also sufficient for proper efficiency. Our results are formula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstract and Applied Analysis
سال: 2013
ISSN: 1085-3375,1687-0409
DOI: 10.1155/2013/492305